#include <iostream>

using namespace std;
typedef long long LL;
const int MOD = 998244353;
LL n, k;

LL qpow(LL a, LL b)
{
	LL ret = 1;
	while (b)
	{
		if (b & 1) ret = ret * a % MOD;
		a = a * a % MOD;
		b >>= 1;
	}
	return ret;
}
int main()
{
	cin >> n >> k;

	cout << qpow(qpow(2, k) - 1, n) << endl;
	return 0;
}